Spider Solitaire is NP-Complete
نویسنده
چکیده
This paper will prove that a generalized version of the popular solitaire variant SpiderSolitaire is NP-Complete. This proof is very similar to section 4.3 of Malte Helmert’s Complexity results for standard benchmark domains in planning Artificial Intelligence 143 (2), pp. 219262. 2003, but is re-tailored to fit the game of SpiderSolitaire, rather the FreeCell. In order to determine the domain of the game the rules of the original game must be understood. The rules can be summarized as follows:
منابع مشابه
Large Peg-Army Maneuvers
Despite its long history, the classical game of peg solitaire continues to attract the attention of the scientific community. In this paper, we consider two problems with an algorithmic flavour which are related with this game, namely Solitaire-Reachability and Solitaire-Army. In the first one, we show that deciding whether there is a sequence of jumps which allows a given initial configuration...
متن کامل2 00 2 Solitaire Clobber
Clobber is a new two-player board game. In this paper, we introduce the oneplayer variant Solitaire Clobber where the goal is to remove as many stones as possible from the board by alternating white and black moves. We show that a checkerboard configuration on a single row (or single column) can be reduced to about n/4 stones. For boards with at least two rows and two columns, we show that a ch...
متن کاملOn the solitaire cone and its relationship to multi-commodity flows
The classical game of Peg Solitaire has uncertain origins, but was certainly popular by the time of LOUIS XIV, and was described by LEIBNIZ in 1710. The modern mathematical study of the game dates to the 1960s, when the solitaire cone was first described by BOARDMAN and CONWAY. Valid inequalities over this cone, known as pagoda functions, were used to show the infeasibility of various peg games...
متن کاملSolitaire Clobber
Clobber is a new two-player board game. In this paper, we introduce the 1-player variant Solitaire Clobber where the goal is to remove as many stones as possible from the board by alternating white and black moves. We show that a checkerboard configuration on a single row (or single column) can be reduced to about n/4 stones. For boards with at least two rows and columns, we show that a checker...
متن کاملSolitaire Chess is NP-complete
Solitaire Chess” is a logic puzzle published by ThinkfunTM that can be seen as a single person version of traditional chess. Given a chess board with some chess pieces of the same color placed on it, the task is to capture all pieces but one using only moves that are allowed in chess. Moreover, in each move one piece has to be captured. We prove that deciding if a given instance of Solitaire Ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1110.1052 شماره
صفحات -
تاریخ انتشار 2011